Coupon Collecting
نویسندگان
چکیده
We consider the classical coupon collector’s problem in which each new coupon collected is type i with probability pi; P i1⁄41 n pi1⁄41. We derive some formulas concerning N, the number of coupons needed to have a complete set of at least one of each type, that are computationally useful when n is not too large. We also present efficient simulation procedures for determining P(N . k), as well as analytic bounds for this probability.
منابع مشابه
The Coupon Subset Collection Problem
The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give effic...
متن کاملCoupon Collecting with or without Replacement, and with Multipurpose Coupons
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
متن کاملCoupon collecting and transversals of hypergraphs
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
متن کاملCoupon Collecting with Quotas
We analyze a variant of the coupon collector’s problem, in which the probabilities of obtaining coupons and the numbers of coupons in a collection may be non-uniform. We obtain a finite expression for the generating function of the probabilities to complete a collection and show how this generalizes several previous results about the coupon collector’s problem. Also, we provide applications abo...
متن کاملPoisson Approximation in a Poisson Limit Theorem Inspired by Coupon Collecting
In this paper we refine a Poisson limit theorem of Gnedenko and Kolmogorov (1954): we determine the error order of a Poisson approximation for sums of asymptotically negligible integer-valued random variables that converge in distribution to the Poisson law. As an application of our results, we investigate the case of the coupon collector’s problem when the distribution of the collector’s waiti...
متن کامل